package exam.wangyi.spring.S3;

import java.util.*;

public class Main {

    public static int n;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        int[] tree = new int[n];
        int k = n / 2;
        int k1 = 1, k2 = 2;
        for (int i=n-1; i>=k; --i) {
            tree[i] = k1;
            k1 += 2;
        }
        for (int i=k-1; i>=0; --i) {
            tree[i] = k2;
            k2 += 2;
        }
        for (int i=0; i<n; ++i) {
            if (i > 0)
                System.out.print(" ");
            System.out.print(tree[i]);
        }
        System.out.println();
    }
}